The equivalence of some general combinatorial decision problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The one-one equivalence of some general combinatorial decision problems

1. Introduction. A decision problem for a combinatorial system shall denote a pair ($, S) where is a specified kind of decision problem (e.g. derivability problem, halting problem, etc.) and 5 is a combina-torial system. Two decision problems (<£i, Si), ($ 2 , £2) are sa ^d t0 be of the same many-one degree (of unsolvability) if there exist effective many-one mappings ƒ and g such that each...

متن کامل

Signature submanifolds for some equivalence problems

This article concerned on the study of signature submanifolds for curves under Lie group actions SE(2), SA(2) and for surfaces under SE(3). Signature submanifold is a regular submanifold which its coordinate components are differential invariants of an associated manifold under Lie group action, and therefore signature submanifold is a key for solving equivalence problems.

متن کامل

Some combinatorial problems of importance

We discuss two combinatorial problems for which we have only sub-optimal solutions. We describe known solutions and we explain why better solutions would be of importance to Cryptography. The areas of application are in improving the ef-ciency of Zero-Knowledge proofs, in relating the quadratic residuosity problem to the problem of integer factorization, and in analyzing some cryptographic sche...

متن کامل

signature submanifolds for some equivalence problems

this article concerned on the study of signature submanifolds for curves under lie group actions se(2), sa(2) and for surfaces under se(3). signature submanifold is a regular submanifold which its coordinate components are di erential invariants of an associated manifold under lie group action, and therefore signature submanifold is a key for solving equivalence problems.

متن کامل

Some Combinatorial Problems in the Plane

1 Let there be given n points in the plane. Denote by t i the number of lines which contain exactly i of the points (2 < i < n). The properties of the set {ti } have been studied a great deal. For example, there is the classical result of Gallai and Sylvester : Assume to = 0 (i .e ., the points are not all on one line) ; then t2 > 0. For the history of this problem see, e.g ., Motzkin [6] and E...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the American Mathematical Society

سال: 1967

ISSN: 0002-9904

DOI: 10.1090/s0002-9904-1967-11780-4